Conal Distances Between Rational Spectral Densities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distances between power spectral densities

We present several natural notions of distance between spectral density functions of (discrete-time) random processes. They are motivated by certain filtering problems. First we quantify the degradation of performance of a predictor which is designed for a particular spectral density function and then used to predict the values of a random process having a different spectral density. The logari...

متن کامل

Spectral Factorization of Non-Rational Matrix-Valued Spectral Densities

Recently, a necessary and sufficient uniform log-integrability condition has been established for the canonical spectral factorization mapping to be sequentially continuous. Under this condition, if a sequence of spectral densities converge to a limiting spectral density then the canonical spectral factors of the sequence converges to the canonical spectral factor of the limiting density. Howev...

متن کامل

Densities, spectral densities and modality

This paper considers the problem of specifying a simple approximating density function for a given data set (x1, . . . , xn). Simplicity is measured by the number of modes but several different definitions of approximation are introduced. The taut string method is used to control the numbers of modes and to produce candidate approximating densities. Refinements are introduced that improve the l...

متن کامل

An Approach to Rational Approximation of Power Spectral Densities on the Unit Circle

In this article, we propose a new approach to determining the best rational approximation of a given irrational power spectral density defined on the unit circle such that the approximant has McMillan degree less than or equal to some positive integer n. The main result is that we prove the existence of an optimal solution and that this solution can be found by standard methods of optimization.

متن کامل

On constructing rational spanning tree edge densities

Let τ(G) and τG(e) denote the number of spanning trees of a graph G and the number of spanning trees of G containing edge e of G, respectively. Ferrara, Gould, and Suffel asked if, for every rational 0 < p/q < 1 there existed a graph G with edge e ∈ E(G) such that τG(e)/τ(G) = p/q. In this note we provide constructions that show this is indeed the case. Moreover, we show this is true even if we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2019

ISSN: 0018-9286,1558-2523,2334-3303

DOI: 10.1109/tac.2018.2855114